Least Square for Grassmann-Cayley Agelbra in Homogeneous Coordinates
نویسندگان
چکیده
This paper presents some tools for least square computation in Grassmann-Cayley algebra, more specifically for elements expressed in homogeneous coordinates. We show that building objects with the outer product from k-vectors of same grade presents some properties that can be expressed in term of linear algebra and can be treated as a least square problem. This paper mainly focuses on line and plane fitting and intersections computation, largely used in computer vision. We show that these least square problems written in Grassmann-Cayley algebra have a direct reformulation in linear algebra, corresponding to their standard expression in projective geometry and hence can be solved using standard least square tools.
منابع مشابه
Statistically Testing Uncertain Geometric Relations
This paper integrates statistical reasoning and Grassmann-Cayley algebra for making 2D and 3D geometric reasoning practical. The multi-linearity of the forms allows rigorous error propagation and statistical testing of geometric relations. This is achieved by representing all objects in homogeneous coordinates and expressing all relations using standard matrix calculus. 1 Motivation Many Comput...
متن کاملHelmer Aslaksen Restricted Homogeneous Coordinates for the Cayley Projective Plane
I. Porteous has shown that the Cayley projective plane can be coordinatized in a way resembling homogeneous coordinates. We will show how to construct line coordinates in a similar way. As an illustration, we give an explicit example to show that the Cayley projective plane is not Desarguean.
متن کاملCombinatorial proofs of Cayley-type identities for derivatives of determinants and pfaffians
The classic Cayley identity states that det(∂) (detX) = s(s+ 1) · · · (s+ n− 1) (detX) where X = (xij) is an n× n matrix of indeterminates and ∂ = (∂/∂xij) is the corresponding matrix of partial derivatives. In this paper we present straightforward combinatorial proofs of a variety of Cayley-type identities, both old and new. The most powerful of these proofs employ Grassmann algebra (= exterio...
متن کاملBest multilinear rank approximation of tensors with quasi-Newton methods on Grassmannians
In this report we present computational methods for the best multilinear rank approximation problem. We consider algorithms build on quasi-Newton methods operating on product of Grassmann manifolds. Specifically we test and compare methods based on BFGS and L-BFGS updates in local and global coordinates with the Newton-Grassmann and alternating least squares methods. The performance of the quas...
متن کاملMatrix representations of finitely generated Grassmann algebras and some consequences
We prove that the m-generated Grassmann algebra can be embedded into a 2 × 2 matrix algebra over a factor of a commutative polynomial algebra in m indeterminates. Cayley–Hamilton and standard identities for n× n matrices over the m-generated Grassmann algebra are derived from this embedding. Other related embedding results are also presented.
متن کامل